Execution Time Program Verification with Tight Bounds

Tight Bounds For Distributed MST Verification

This paper establishes tight bounds for the Minimum-weight Spanning Tree (MST) verification problem in the distributed setting. Specifically, we provide an MST verification algorithm that achieves simultaneously Õ(|E|) messages and Õ( √ n+D) time, where |E| is the number of edges in the given graph G and D is G’s diameter. On the negative side, we show that any MST verification algorithm must s...

Unbounded Symbolic Execution for Program Verification

Symbolic execution with interpolation is emerging as an alternative to CEGAR for software verification. The performance of both methods relies critically on interpolation in order to obtain the most general abstraction of the current symbolic or abstract state which can be shown to remain error-free. CEGAR naturally handles unbounded loops because it is based on abstract interpretation. In cont...

Language-Independent Program Verification Using Symbolic Execution

In this paper we present an automatic and language-independent program verification approach based on symbolic execution. The specification formalism we consider is Reachability Logic, a language-independent logic that constitutes an alternative to Hoare logics. Reachability Logic has a sound and relatively complete deduction system, which offers a lot of freedom (but no guidelines) for constru...

Practical Program Verification by Forward Symbolic Execution: Correctness and Examples

We present the theoretical aspects and a prototype implementation in the Theorema system of a method for the verification of recursive imperative programs. The method is based on forward symbolic execution and functional semantics and generates first order verification conditions for the total correctness which use only the underlying theory of the program. All verification conditions are gener...

Symbolic program execution using the Erlang verification tool